Eulerian – Eulerian Large Eddy Simulations Applied to Non-Reactive Transient Diesel Sprays
نویسندگان
چکیده
منابع مشابه
Eulerian transported probability density function sub-filter model for large-eddy simulations of turbulent combustion
Reactive flow simulations using large-eddy simulations (LES) require modelling of sub-filter fluctuations. Although conserved scalars like mixture fraction can be represented using a beta-function, the reactive scalar probability density function (PDF) does not follow an universal shape. A one-point one-time joint composition PDF transport equation can be used to describe the evolution of the s...
متن کاملEulerian quadrature-based moment models for dilute polydisperse evaporating sprays
Dilute liquid sprays can be modeled at the mesoscale using a kinetic equation, namely the Williams-Boltzmann equation, containing terms for spatial transport, evaporation and fluid drag. The most common method for simulating the Williams-Boltzmann equation uses Lagrangian particle tracking wherein a finite ensemble of numerical “parcels” provides a statistical estimate of the joint surface area...
متن کاملBlock-structured grids for Eulerian gyrokinetic simulations
In order to predict the turbulent transport in magnetic fusion experiments, global (i.e., full-torus) gyrokinetic simulations are often carried out. In this context, one frequently encounters situations in which the plasma temperature varies by large factors across the radial simulation domain. In grid-based Eulerian codes, this enforces the use of a very large number of grid points in the two-...
متن کاملEditing to Eulerian Graphs
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively. For any S ⊆ {ea, ed, vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and...
متن کاملOn Interval Non-Edge-Colorable Eulerian Multigraphs
An edge-coloring of a multigraph G with colors 1, . . . , t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this note, we show that all Eulerian multigraphs with an odd number of edges have no interval coloring. We also give some methods for constructing of interval non-edge-colorable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oil & Gas Science and Technology – Revue d’IFP Energies nouvelles
سال: 2013
ISSN: 1294-4475,1953-8189
DOI: 10.2516/ogst/2013140